The decidability border of hereditary history preserving bisimilarity
نویسنده
چکیده
In 2000 Jurdziński and Nielsen proved that hereditary history preserving bisimilarity (hhp-b) is undecidable for finite systems [7,8], and thereby resolved a long-standing open problem. The negative outcome contrasts the weaker history preserving bisimilarity (hp-b), for which decidability is well-established [15,6]. A definition of (h)hp-b on labelled 1-safe Petri nets (net systems) follows.
منابع مشابه
Laboratory for Foundations of Computer Science Hereditary History Preserving Bisimilarity Coincides with History Preserving Bisimilarity for a Class of Live Free Choice Systems
History preserving (hp) and hereditary hp (hhp) bisimilarity are two equivalences for concurrent systems that reflect causal dependencies between events. hp bisimilarity is well-known to be decidable for finite-state systems, whereas the decidability of hhp bisimilarity had been a renowned open problem for several years until it was finally proved undecidable. Recently, the following positive r...
متن کاملHereditary History Preserving Bisimilarity Coincides with History Preserving Bisimilarity for a Class of Live Free Choice Systems
History preserving (hp) and hereditary hp (hhp) bisimilarity are two equivalences for concurrent systems that reflect causal dependencies between events. hp bisimilarity is well-known to be decidable for finite-state systems, whereas the decidability of hhp bisimilarity had been a renowned open problem for several years until it was finally proved undecidable. Recently, the following positive r...
متن کاملHereditary History-Preserving Bisimilarity: Logics and Automata
We study hereditary history-preserving (hhp-) bisimilarity, a canonical behavioural equivalence in the true concurrent spectrum, by means of logics and automata. We first show that hhp-bisimilarity on prime event structures can be characterised in terms of a simple logic whose formulae just observe events in computations and check their executability. The logic suggests a characterisation of hh...
متن کاملNon-interleaving bisimulation equivalences on Basic Parallel Processes
We show polynomial time algorithms for deciding hereditary history preserving bisimilarity (in O(n logn)) and history preserving bisimilarity (in O(n)) on the class Basic Parallel Processes. The latter algorithm also decides a number of other non-interleaving behavioural equivalences (e.g., distributed bisimilarity) which are known to coincide with history preserving bisimilarity on this class....
متن کاملOn Plain and Hereditary History-Preserving Bisimulation
We investigate the difference between two well-known notions of independence bisimilarity, history-preserving bisimulation and hereditary history-preserving bisimulation. We characterise the difference between the two bisimulations in trace-theoretical terms, advocating the view that the first is (just) a bisimulation for causality, while the second is a bisimulation for concurrency. We explore...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 93 شماره
صفحات -
تاریخ انتشار 2005